In linear probing, if the initial slot \(h(k)\) is taken, we try the next slot \(h(k)+1\), then \(h(k)+2\), and so on, until an empty slot is found.